How many random edges make a dense hypergraph non-2-colorable?
نویسندگان
چکیده
منابع مشابه
How many random edges make a dense hypergraph non-2-colorable?
We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model for graphs has been started by Bohman et al. in [7], and continued in [8] and [16]. Here we obtain a tight bound on the number of random edges required to ensure non-2-colorability. We prove that for any k-uniform hypergr...
متن کاملHow many random edges make a dense graph hamiltonian?
This paper investigates the number of random edges required to add to an arbitrary dense graph in order to make the resulting graph hamiltonian with high probability. Adding (n) random edges is both necessary and sufficient to ensure this for all such dense graphs. If, however, the original graph contains no large independent set, then many fewer random edges are required. We prove a similar re...
متن کاملConstruction of a Non-2-colorable k-uniform Hypergraph with Few Edges
We show how to construct a non-2-colorable k-uniform hypergraph with (2) edges. By the duality of hypergraphs and monotone CNF-formulas this gives an unsatisfiable monotone k-CNF with (2) clauses.
متن کاملHow many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected?
In this paper we study the randomly edge colored graph that is obtained by adding randomly colored random edges to an arbitrary randomly edge colored dense graph. In particular we ask how many colors and how many random edges are needed so that the resultant graph contains a fixed number of edge disjoint rainbow Hamilton cycles. We also ask when in the resultant graph every pair of vertices is ...
متن کاملmany drops make a lake
the desire and drive for excellence in any endeavor in life requires an effort from the individual; in addition it requires a constellation of features around such individuals that help them to become successful. for surgeons, it is the operating room staff, the administrative and medical assistants and our residents and fellows. however, perhaps the most important contribution to a physician’s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2008
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.25155